Prime factors of consecutive integers
نویسندگان
چکیده
This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers at least one of whose prime factors exceeds k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton.
منابع مشابه
Fifteen consecutive integers with exactly four prime factors
We describe a successful search for a sequence of fifteen consecutive integers, each the product of exactly four prime factors. Fifteen is best possible.
متن کاملOn Strings of Consecutive Integers with No Large Prime Factors
We investigate conditions which ensure that systems of binomial polynomials with integer coefficients are simultaneously free of large prime factors. In particular, for each positive number ", we show that there are infinitely many strings of consecutive integers of size about n, free of prime factors exceeding n, with the length of the strings tending to infinity with speed log log log log n. ...
متن کاملACTÁ ARITHMETICA XLIX (1988) Prime factors of binomial coefficients and related problems
1 . Sequences of positive integers with the consecutive integer property. Consider a sequence of k positive integers {ai} = a,, . . ., a k with the following properties : (i) ai < k for all i, (ü) (the consecutive integer property) There is an n such that ai is the quotient when n + i is cleared of all its prime factors greater than k . Or, for each prime p k, the pattern of that prime and its ...
متن کاملA New Proof of Euclid's Theorem
New proof. Let n be an arbitrary positive integer greater than 1. Since n and n + 1 are consecutive integers, they must be coprime. Hence the number N2 = n(n + 1) must have at least two different prime factors. Similarly, since the integers n(n+1) and n(n+1)+1 are consecutive, and therefore coprime, the number N3 = n(n + 1)[n(n + 1) + 1] must have at least three different prime factors. This pr...
متن کاملOn the Maximal Length of Two Sequences of Consecutive Integers with the Same Prime Divisors
The initial motivation of the present paper is the following problem of Erd6s and Woods, whose solution would be of interest in logic (see [3, 6, 11, 10, 16]): Does there exist an integer k >=2 with the following property : i f x and y are positive integers such that for l<=i<=k, the two numbers x+ i and y+i have the same prime factors, then x=y. For each integer n->2, let us denote by Supp (n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 77 شماره
صفحات -
تاریخ انتشار 2008